package ink.lovejinhu.leetcode;

import java.util.Stack;

/**
 * @author jinhu
 * created 2021-07-01 9:29
 */
public class Solution_0155 {
    public Stack<Integer> stack = new Stack();
    /**
     * 设计一个最小栈
     */

    /**
     * initialize your data structure here.
     */
    public Solution_0155() {

    }

    public void push(int val) {
        stack.push(val);
    }

    public void pop() {
        stack.pop();
    }

    public int top() {
        return stack.peek();
    }

    public int getMin() {

        return 0;
    }
}
